NON-LINEAR MINI-MAX PROBLEM OF MULTI-STOP FLIGHT ROUTES

Computing Linear Mini-max Estimators

Consider a vector of data y = + "; y 2 IR n , where " = (" i) 1in is an error vector which satisses the "usual\ conditions, and 2 IR n. The problem is to nd/compute a vector m for which hm;yi minimizes the maximal risk among all linear estimators, i.e. m is a solution of min m2IR n max 2 E h`;i ? hm;i 2 , ` 2 IR n given. A solution of this mini-max problem is determined by the solution of the f...

on the effect of linear & non-linear texts on students comprehension and recalling

چکیده ندارد.

Solving multi objective linear Bilevel multi follower programming problem

A Genetic Algorithm for the Mini-Max Spanning Forest Problem

Consider an election of r seats in country consisting of r cities and several villages. The problem is to divide the country into r electoral districts in such a way that each district consists of a city and some villages which are not separated by other districts. The total population of each district must be as balanced as possible. Generally, as each district can be regarded as the nodes on ...

On the integer max-linear programming problem

For a generic class of matrices we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.